منابع مشابه
Asymmetric k-center with minimum coverage
In this paper we give approximation algorithms and inapproximability results for various asymmetric k-center with minimum coverage problems. In the k-center with minimum coverage problem, each center is required to serve a minimum number of clients. These problems have been studied by Lim et al. [Theor. Comput. Sci. 2005] in the symmetric setting. In the q-all-coverage k-center problem each cen...
متن کاملk-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centerswhile allowing each center to cater to a spread of clients.We study three variants of this problem, all of which are shown to beNP-hard. In-approximation hardness and approximation a...
متن کاملTight lower bounds for the asymmetric k-center problem
In the k-center problem, the input is a bound k and n points with the distance between every two of them, such that the distances obey the triangle inequality. The goal is to choose a set of k points to serve as centers, so that the maximum distance from the centers C to any point is as small as possible. This fundamental facility location problem is NP-hard. The symmetric case is well-understo...
متن کاملSymmetric and Asymmetric $k$-center Clustering under Stability
The k-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms. Both versions of the problem have tight approximation factors on worst case instances: a 2-approximation for symmetric k-center and an O(log∗(k))-approximation for the asymmetric version. Therefore to improve on these ratios, one must g...
متن کامل) - Approximation Algorithms for the Asymmetric k � Center Problem Aaron Archer
Given a set V of n points and the distances between each pair, the k-center problem asks us to choose a subset C V of size k that minimizes the maximum over all points of the distance from C to the point. This problem is NPhard even when the distances are symmetric and satisfy the triangle inequality, and Hochbaum and Shmoys gave a best-possible 2-approximation for this case. We consider the ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.08.006